Apparatus and method for processing video data

ABSTRACT

An apparatus and methods for processing video data are described. The invention provides a representation of video data that can be used to assess agreement between the data and a fitting model for a particular parameterization of the data. This allows the comparison of different parameterization techniques and the selection of the optimum one for continued video processing of the particular data. The representation can be utilized in intermediate form as part of a larger process or as a feedback mechanism for processing video data. When utilized in its intermediate form, the invention can be used in processes for storage, enhancement, refinement, feature extraction, compression, coding, and transmission of video data. The invention serves to extract salient information in a robust and efficient manner while addressing the problems typically associated with video data sources.

This application claims the priority of U.S. Provisional Application No.60/667,532, titled “System And Method For Video Compression EmployingPrincipal Component Analysis,” filed Mar. 31, 2005 and U.S. ProvisionalApplication No. 60/670,951, titled “Apparatus and Methods for ProcessingVideo Data,” filed Apr. 13, 2005. This application is acontinuation-in-part of U.S. application Ser. No. 11/336,366 filed Jan.20, 2006, which is a continuation-in-part of U.S. application Ser. No.11/280,625 filed Nov. 16, 2005, which is a continuation-in-part of U.S.application Ser. No. 11/230,686, filed Sep. 20, 2005, which is acontinuation-in-part of U.S. application Ser. No. 11/191,562, filed Jul.28, 2005 now U.S. Pat. No. 7,158,680. Each of the foregoing applicationsis incorporated herein by reference in its entirety.

FIELD OF THE INVENTION

The present invention is generally related to the field of digitalsignal processing, and more particularly, to computer apparatus andcomputer-implemented methods for the efficient representation andprocessing of signal or image data, and most particularly, video data.

DESCRIPTION OF THE PRIOR ART

The general system description of the prior art in which the currentinvention resides can be expressed as in FIG. 1. Here a block diagramdisplays the typical prior art video processing system. Such systemstypically include the following stages: an input stage 102, a processingstage 104, an output stage 106, and one or more data storagemechanism(s) 108.

The input stage 102 may include elements such as camera sensors, camerasensor arrays, range finding sensors, or a means of retrieving data froma storage mechanism. The input stage provides video data representingtime correlated sequences of man-made and/or naturally occurringphenomena. The salient component of the data may be masked orcontaminated by noise or other unwanted signals.

The video data, in the form of a data stream, array, or packet, may bepresented to the processing stage 104 directly or through anintermediate storage element 108 in accordance with a predefinedtransfer protocol. The processing stage 104 may take the form ofdedicated analog or digital devices, or programmable devices such ascentral processing units (CPUs), digital signal processors (DSPs), orfield programmable gate arrays (FPGAs) to execute a desired set of videodata processing operations. The processing stage 104 typically includesone or more CODECs (COder/DECcoders).

Output stage 106 produces a signal, display, or other response which iscapable of affecting a user or external apparatus. Typically, an outputdevice is employed to generate an indicator signal, a display, ahardcopy, a representation of processed data in storage, or to initiatetransmission of data to a remote site. It may also be employed toprovide an intermediate signal or control parameter for use insubsequent processing operations.

Storage is presented as an optional element in this system. Whenemployed, storage element 108 may be either non-volatile, such asread-only storage media, or volatile, such as dynamic random accessmemory (RAM). It is not uncommon for a single video processing system toinclude several types of storage elements, with the elements havingvarious relationships to the input, processing, and output stages.Examples of such storage elements include input buffers, output buffers,and processing caches.

The primary objective of the video processing system in FIG. 1 is toprocess input data to produce an output which is meaningful for aspecific application. In order to accomplish this goal, a variety ofprocessing operations may be utilized, including noise reduction orcancellation, feature extraction, object segmentation and/ornormalization, data categorization, event detection, editing, dataselection, data re-coding, and transcoding.

Many data sources that produce poorly constrained data are of importanceto people, especially sound and visual images. In most cases theessential characteristics of these source signals adversely impact thegoal of efficient data processing. The intrinsic variability of thesource data is an obstacle to processing the data in a reliable andefficient manner without introducing errors arising from naïve empiricaland heuristic methods used in deriving engineering assumptions. Thisvariability is lessened for applications when the input data arenaturally or deliberately constrained into narrowly definedcharacteristic sets (such as a limited set of symbol values or a narrowbandwidth). These constraints all too often result in processingtechniques that are of low commercial value.

The design of a signal processing system is influenced by the intendeduse of the system and the expected characteristics of the source signalused as an input. In most cases, the performance efficiency requiredwill also be a significant design factor. Performance efficiency, inturn, is affected by the amount of data to be processed compared withthe data storage available as well as the computational complexity ofthe application compared with the computing power available.

Conventional video processing methods suffer from a number ofinefficiencies which are manifested in the form of slow datacommunication speeds, large storage requirements, and disturbingperceptual artifacts. These can be serious problems because of thevariety of ways people desire to use and manipulate video data andbecause of the innate sensitivity people have for some forms of visualinformation.

An “optimal” video processing system is efficient, reliable, and robustin performing a desired set of processing operations. Such operationsmay include the storage, transmission, display, compression, editing,encryption, enhancement, categorization, feature detection, andrecognition of the data. Secondary operations may include integration ofsuch processed data with other information sources. Equally important,in the case of a video processing system, the outputs should becompatible with human vision by avoiding the introduction of perceptualartifacts.

A video processing system may be described as “robust” if its speed,efficiency, and quality do not depend strongly on the specifics of anyparticular characteristics of the input data. Robustness also is relatedto the ability to perform operations when some of the input iserroneous. Many video processing systems fail to be robust enough toallow for general classes of applications—providing only application tothe same narrowly constrained data that was used in the development ofthe system.

Salient information can be lost in the discretization of acontinuous-valued data source due to the sampling rate of the inputelement not matching the signal characteristics of the sensed phenomena.Also, there is loss when the signal's strength exceeds the sensor'slimits, resulting in saturation. Similarly, information is lost when theprecision of input data is reduced as happens in any quantizationprocess when the full range of values in the input data is representedby a set of discrete values, thereby reducing the precision of the datarepresentation.

Ensemble variability refers to any unpredictability in a class of dataor information sources. Data representative of visual information has avery large degree of ensemble variability because visual information istypically unconstrained. Visual data may represent any spatial arraysequence or spatio-temporal sequence that can be formed by lightincident on a sensor array.

In modeling visual phenomena, video processors generally impose some setof constraints and/or structure on the manner in which the data isrepresented or interpreted. As a result, such methods can introducesystematic errors which would impact the quality of the output, theconfidence with which the output may be regarded, and the type ofsubsequent processing tasks that can reliably be performed on the data.

Quantization methods reduce the precision of data in the video frameswhile attempting to retain the statistical variation of that data.Typically, the video data is analyzed such that the distributions ofdata values are collected into probability distributions. There are alsomethods that project the data into phase space in order to characterizethe data as a mixture of spatial frequencies, thereby allowing precisionreduction to be diffused in a less objectionable manner. When utilizedheavily, these quantization methods often result in perceptuallyimplausible colors and can induce abrupt pixilation in originally smoothareas of the video frame.

Differential coding is also typically used to capitalize on the localspatial similarity of data. Data in one part of the frame tend to beclustered around similar data in that frame, and also in a similarposition in subsequent frames. Representing the data in terms of itsspatially adjacent data can then be combined with quantization and thenet result is that, for a given precision, representing the differencesis more accurate than using the absolute values of the data. Thisassumption works well when the spectral resolution of the original videodata is limited, such as in black and white video, or low-color video.As the spectral resolution of the video increases, the assumption ofsimilarity breaks down significantly. The breakdown is due to theinability to selectively preserve the precision of the video data.

Residual coding is similar to differential encoding in that the error ofthe representation is further differentially encoded in order to restorethe precision of the original data to a desired level of accuracy.

Variations of these methods attempt to transform the video data intoalternate representations that expose data correlations in spatial phaseand scale. Once the video data has been transformed in these ways,quantization and differential coding methods can then be applied to thetransformed data resulting in an increase in the preservation of thesalient image features. Two of the most prevalent of these transformvideo compression techniques are the discrete cosine transform (DCT) anddiscrete wavelet transform (DWT). Error in the DCT transform manifestsin a wide variation of video data values, and therefore, the DCT istypically used on blocks of video data in order to localize these falsecorrelations. The artifacts from this localization often appear alongthe border of the blocks. For the DWT, more complex artifacts happenwhen there is a mismatch between the basis function and certaintextures, and this causes a blurring effect. To counteract the negativeeffects of DCT and DWT, the precision of the representation is increasedto lower distortion at the cost of precious bandwidth.

SUMMARY OF THE INVENTION

The present invention is a computer-implemented video processing methodthat provides both computational and analytical advantages over existingstate-of-the-art methods. The principle inventive method is theintegration of a linear decompositional method, a spatial segmentationmethod, and a spatial normalization method. Spatially constraining videodata greatly increases the robustness and applicability of lineardecompositional methods. Additionally, spatial segmentation of the datacorresponding to the spatial normalization, can further serve toincrease the benefits derived from spatial normalization alone.

In particular, the present invention provides a means by which signaldata can be efficiently processed into one or more beneficialrepresentations. The present invention is efficient at processing manycommonly occurring data sets and is particularly efficient at processingvideo and image data. The inventive method analyzes the data andprovides one or more concise representations of that data to facilitateits processing and encoding. Each new, more concise data representationallows reduction in computational processing, transmission bandwidth,and storage requirements for many applications, including, but notlimited to: encoding, compression, transmission, analysis, storage, anddisplay of the video data. The invention includes methods foridentification and extraction of salient components of the video data,allowing a prioritization in the processing and representation of thedata. Noise and other unwanted parts of the signal are identified aslower priority so that further processing can be focused on analyzingand representing the higher priority parts of the video signal. As aresult, the video signal is represented more concisely than waspreviously possible. And the loss in accuracy is concentrated in theparts of the video signal that are perceptually unimportant.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram illustrating a prior art video processingsystem.

FIG. 2 is a block diagram providing an overview of the invention thatshows the major modules for processing video.

FIG. 3 is a block diagram illustrating the motion estimation method ofthe invention.

FIG. 4 is a block diagram illustrating the global registration method ofthe invention.

FIG. 5 is a block diagram illustrating the normalization method of theinvention.

FIG. 6 is a block diagram illustrating the hybrid spatial normalizationcompression method.

FIG. 7 is a block diagram illustrating the mesh generation method of theinvention employed in local normalization.

FIG. 8 is a block diagram illustrating the mesh based normalizationmethod of the invention employed in local normalization.

FIG. 9 is a block diagram illustrating the combined global and localnormalization method of the invention.

FIG. 10 is a block diagram illustrating the GPCA—basic polynomialfitting and differentiation method of the invention.

FIG. 11 is a block diagram illustrating the recursive GPCA refinementmethod of the invention.

FIG. 12 is a block diagram illustrating the background resolutionmethod.

FIG. 13 is a block diagram illustrating the object segmentation methodof the invention.

FIG. 14 is a block diagram illustrating the object interpolation methodof the invention.

DETAILED DESCRIPTION

In video signal data, frames of video are assembled into a sequence ofimages usually depicting a three dimensional scene as projected, imaged,onto a two dimensional imaging surface. Each frame, or image, iscomposed of picture elements (pels) that represent an imaging sensorresponse to the sampled signal. Often, the sampled signal corresponds tosome reflected, refracted, or emitted energy, (e.g. electromagnetic,acoustic, etc) sampled by a two dimensional sensor array. A successivesequential sampling results in a spatiotemporal data stream with twospatial dimensions per frame and a temporal dimension corresponding tothe frame's order in the video sequence.

The present invention as illustrated in FIG. 2 analyzes signal data andidentifies the salient components. When the signal is comprised of videodata, analysis of the spatiotemporal stream reveals salient componentsthat are often specific objects, such as faces. The identificationprocess qualifies the existence and significance of the salientcomponents, and chooses one or more of the most significant of thosequalified salient components. This does not limit the identification andprocessing of other less salient components after or concurrently withthe presently described processing. The aforementioned salientcomponents are then further analyzed, identifying the variant andinvariant subcomponents. The identification of invariant subcomponentsis the process of modeling some aspect of the component, therebyrevealing a parameterization of the model that allows the component tobe synthesized to a desired level of accuracy.

In one embodiment of the invention, a foreground object is detected andtracked. The object's pels are identified and segmented from each frameof the video. The block-based motion estimation is applied to thesegmented object in multiple frames. These motion estimates are thenintegrated into a higher order motion model. The motion model isemployed to warp instances of the object to a common spatialconfiguration. For certain data, in this configuration, more of thefeatures of the object are aligned. This normalization allows the lineardecomposition of the values of the object's pels over multiple frames tobe compactly represented. The salient information pertaining to theappearance of the object is contained in this compact representation.

A preferred embodiment of the present invention details the lineardecomposition of a foreground video object. The object is normalizedspatially, thereby yielding a compact linear appearance model. A furtherpreferred embodiment additionally segments the foreground object fromthe background of the video frame prior to spatial normalization.

A preferred embodiment of the invention applies the present invention toa video of a person speaking into a camera while undergoing a smallamount of motion.

A preferred embodiment of the invention applies the present invention toany object in a video that can be represented well through spatialtransformations.

A preferred embodiment of the invention specifically employs block-basedmotion estimation to determine finite differences between two or moreframes of video. A higher order motion model is factored from the finitedifferences in order to provide a more effective linear decomposition.

Detection & Tracking

It is known in the art to detect an object in a frame and to track thatobject through a predetermined number of later frames. Among thealgorithms and programs that can be used to perform the object detectionfunction is the Viola/Jones: P. Viola and M. Jones, “Robust Real-timeObject Detection,” in Proc. 2nd Int'l Workshop on Statistical andComputational Theories of Vision—Modeling, Learning, Computing andSampling, Vancouver, Canada, Jul. 2001. Likewise, there are a number ofalgorithms and programs that can be used to track the detected objectthrough successive frames. An example includes: C. Edwards, C. Taylor,and T. Cootes. “Learning to identify and track faces in an imagesequence.” Proc. Int'l Conf. Auto. Face and Gesture Recognition, pages260-265, 1998.

The result of the object detection process is a data set that specifiesthe general position of the center of the object in the frame and anindication as to the scale (size) of the object. The result of thetracking process is a data set that represents a temporal label for theobject and assures that to a certain level of probability the objectdetected in the successive frames is the same object.

The object detection and tracking algorithm may be applied to a singleobject in the frames or to two or more objects in the frames.

It is also known to track one or more features of the detected object inthe group of sequential frames. If the object is a human face, forexample, the features could be an eye or a nose. In one technique, afeature is represented by the intersection of “lines” that can looselybe described as a “corner.” Preferably, “corners” that are both strongand spatially disparate from each other are selected as features. Thefeatures may be identified through a spatial intensity field gradientanalysis. Employing a hierarchical multi-resolution estimation of theoptical flow allows the determination of the translational displacementof the features in successive frames. M. J. Black and Y. Yacoob.“Tracking and recognizing rigid and non-rigid facial motions using localparametric models of image motions.” In Proceedings of the InternationalConference on Computer Vision, pages 374-381, Boston, Mass. Jun. 1995 isan example of an algorithm that uses this technique to track features.

Once the constituent salient components of the signal have beendetermined, these components may be retained, and all other signalcomponents may be diminished or removed. The process of detecting thesalient component is shown in FIG. 2, where the Video Frame (202) isprocessed by one or more Detect Object (206) processes, resulting in oneor more objects being identified, and subsequently tracked. The retainedcomponents represent the intermediate form of the video data. Thisintermediate data can then be encoded using techniques that aretypically not available to existing video processing methods. As theintermediate data exists in several forms, standard video encodingtechniques can also be used to encode several of these intermediateforms. For each instance, the present invention determines and thenemploys the encoding technique that is most efficient.

In one preferred embodiment, a saliency analysis process detects andclassifies salient signal modes. One embodiment of this process employsa combination of spatial filters specifically designed to generate aresponse signal whose strength is relative to the detected saliency ofan object in the video frame. The classifier is applied at differingspatial scales and in different positions of the video frame. Thestrength of the response from the classifier indicates the likelihood ofthe presence of a salient signal mode. When centered over a stronglysalient object, the process classifies it with a correspondingly strongresponse. The detection of the salient signal mode distinguishes thepresent invention by enabling the subsequent processing and analysis onthe salient information in the video sequence.

Given the detection location of a salient signal mode in one or moreframes of video, the present invention analyzes the salient signalmode's invariant features. Additionally, the invention analyzes theresidual of the signal, the “less-salient” signal modes, for invariantfeatures. Identification of invariant features provides a basis forreducing redundant information and segmenting (i.e. separating) signalmodes.

Feature Point Tracking

In one embodiment of the present invention, spatial positions in one ormore frames are determined through spatial intensity field gradientanalysis. These features correspond to some intersection of “lines”which can be described loosely as a “corner”. Such an embodiment furtherselects a set of such corners that are both strong corners and spatiallydisparate from each other, herein referred to as the feature points.Further, employing a hierarchical multi-resolution estimation of theoptical flow allows the determination of the translational displacementof the feature points over time.

In FIG. 2, the Track Object (220) process is shown to pull together thedetection instances from the Detect Object processes (208) and furtherIdentify Correspondences (222) of features of one or more of thedetected objects over a multitude of Video Frames (202 & 204).

A non-limiting embodiment of feature tracking can be employed such thatthe features are used to qualify a more regular gradient analysis methodsuch as block-based motion estimation.

Another embodiment anticipates the prediction of motion estimates basedon feature tracking.

Object-Based Detection and Tracking

In one non-limiting embodiment of the current invention, a robust objectclassifier is employed to track faces in frames of video. Such aclassifier is based on a cascaded response to oriented edges that hasbeen trained on faces. In this classifier, the edges are defined as aset of basic Haar features and the rotation of those features by 45degrees. The cascaded classifier is a variant of the AdaBoost algorithm.Additionally, response calculations can be optimized through the use ofsummed area tables.

Local Registration

Registration involves the assignment of correspondences between elementsof identified objects in two or more video frames. These correspondencesbecome the basis for modeling the spatial relationships between videodata at temporally distinct points in the video data.

Various non-limiting means of registration are described for the presentinvention in order to illustrate specific embodiments and theirassociated reductions to practice in terms of well known algorithms andinventive derivatives of those algorithms.

One means of modeling the apparent optical flow in a spatio-temporalsequence can be achieved through generation of a finite difference fieldfrom two or more frames of the video data. Optical flow field can besparsely estimated if the correspondences conform to certain constancyconstraints in both a spatial and an intensity sense.

As shown in FIG. 3, a Frame (302 or 304) is sub-sampled spatially,possibly through a decimation process (306), or some other sub-samplingprocess (e.g. low pass filter). These spatially reduced images (310 &312) can be further sub-sampled as well.

Diamond Search

Given a non-overlapping partitioning of a frame of video into blocks,search the previous frame of video for a match to each block. The fullsearch block-based (FSBB) motion estimation finds the position in theprevious frame of video that has the lowest error when compared with ablock in the current frame. Performing FSBB can be quite expensivecomputationally, and often does not yield a better match than othermotion estimation schemes based on the assumption of localized motion.Diamond search block-based (DSBB) gradient descent motion estimation isa common alternative to FSBB that uses a diamond shaped search patternof various sizes to iteratively traverse an error gradient toward thebest match for a block.

In one embodiment of the present invention, DSBB is employed in theanalysis of the image gradient field between one or more frames of videoin order to generate finite differences whose values are later factoredinto higher order motion models.

One skilled in the art is aware that block-based motion estimation canbe seen as the equivalent of an analysis of vertices of a regular mesh.

Mesh-Based Motion Estimation

Mesh based prediction uses a geometric mesh of vertices connected byedges to delineate discrete regions of the video frame and thensubsequently predict the deformation and movement of those regions insubsequent frames through deformation models controlled by the positionof the mesh vertices. As the vertices are moved, the pels within theregions defined by the vertices are moved as well to predict the currentframe. The relative movement and resulting approximation of the originalpel values are performed through some interpolation method thatassociates the pel position with that of the vertices in the vicinity ofthat pel. The additional modeling of scaling and rotation as compared topure translation can produce a more accurate prediction of the frame'spels when such motions are present in the video signal.

Generally, mesh models can be defined as being regular or adaptive.Regular mesh models are laid out without considering the underlyingsignal characteristics while adaptive methods attempt to spatial arrangevertices and edges relative to features of the underlying video signal.

Regular mesh representations provide a means by which the motion, orequivalently the deformations inherent in the motion, can be predictedor modeled, provided the imaged objects in the video have spatialdiscontinuities that more correspond to edges in the mesh.

Adaptive meshes are formed with substantially greater consideration forthe features of the underlying video signal than regular meshes.Additionally, the adaptive nature of such a mesh may allow for variousrefinements of the mesh over time.

The present invention adjusts the vertex search order using homogeneitycriteria in order to perform mesh, and equivalently pel, registration.Vertices that are associated spatially with heterogeneous intensitygradients are motion estimated before those having a more homogenousgradient.

In a preferred embodiment, the vertex motion estimation of the mesh isadditionally prioritized through a spatial flood-filling of motionestimation for vertices of equivalent or near equivalent homogeneity.

In a preferred embodiment, the original mesh spatial configuration andfinal mesh configuration are mapped to each other on a facet level byfilling a mapping image with facet identifiers using standard graphicalfilling routines. The affine transformations associated with eachtriangle can be quickly looked up in a transform table and pel positionsassociated with a facet in one mesh can quickly be transformed into aposition in the other mesh.

In a preferred embodiment, a preliminary motion estimation is made forvertices in order to assess the residual error associated with eachmotion estimation match. This preliminary estimation is additionallyused to prioritize the motion estimation order of the vertices. Theadvantage of such a residual error analysis is that motion estimatesthat are associated with less distortion will result in maintaining amore plausible mesh topology.

In a preferred embodiment, mesh vertex motion estimates are scaled downto some limited range and multiple motion estimations are made throughseveral iterations in order to allow the mesh to approach a moreglobally optimal and topologically correct solution.

In a preferred embodiment, block-based motion estimates utilizing arectangular tile neighborhood centered on each vertex is used todetermine the vertex displacement in deference to an interpolatedpolygon neighborhood. In addition to a avoiding a spatial interpolationand warping of pels for error gradient descent, this technique alsoallows parallel computation of motion estimates.

Phase-Based Motion Estimation

In the prior art, block-based motion estimation typically implemented asa spatial search resulting in one or more spatial matches. Phase-basednormalized cross correlation (PNCC) as illustrated in FIG. 3 transformsa block from the current frame and the previous frame into “phase space”and finds the cross correlation of those two blocks. The crosscorrelation is represented as a field of values whose positionscorrespond to the ‘phase shifts’ of edges between the two blocks. Thesepositions are isolated through thresholding and then transformed backinto spatial coordinates. The spatial coordinates are distinct edgedisplacements, and correspond to motion vectors.

Advantages of the PNCC include contrast masking which allows thetolerance of gain/exposure adjustment in the video stream. Also, thePNCC allows results from a single step that might take many iterationsfrom a spatially based motion estimator. Further, the motion estimatesare sub-pixel accurate.

One embodiment of the invention utilizes PNCC in the analysis of theimage gradient field between one or more frames of video in order togenerate finite differences whose values are later factored into higherorder motion models.

Global Registration

In one embodiment, the present invention generates a correspondencemodel by using the relationships between corresponding elements of adetected object in two or more frames of video. These relationships areanalyzed by factoring one or more linear models from a field of finitedifference estimations. The term field refers to each finite differencehaving a spatial position. These finite differences may be thetranslational displacements of corresponding object features indisparate frames of video described in the Detection & Tracking section.The field from which such sampling occurs is referred to herein as thegeneral population of finite differences. The described method employsrobust estimation similar to that of the RANSAC algorithm as describedin: M. A. Fischler, R. C. Bolles. “Random Sample Consensus: A Paradigmfor Model Fitting with Applications to Image Analysis and AutomatedCartography.” Comm. of the ACM, Vol 24, pp 381-395, 1981.

As shown in FIG. 4, the finite differences, in the case of global motionmodeling, are Translational Motion Estimates (402) that are collectedinto a General Population Pool (404) which is iteratively processed by aRandom Sampling of those Motion Estimates (410) and a linear model isfactored out (420) of those samples. The Results are then used to adjustthe population (404) to better clarify the linear model through theexclusion of outliers to the model, as found through the random process.

The present invention is able to utilize one or more robust estimators;one of which may be the RANSAC robust estimation process. Robustestimators are well documented in the prior art.

In one embodiment of the linear model estimation algorithm, the motionmodel estimator is based on a linear least squares solution. Thisdependency causes the estimator to be thrown off by outlier data. Basedon RANSAC, the disclosed method is a robust method of countering theeffect of outliers through the iterative estimation of subsets of thedata, probing for a motion model that will describe a significant subsetof the data. The model generated by each probe is tested for thepercentage of the data that it represents. If there are a sufficientnumber of iterations, then a model will be found that fits the largestsubset of the data. A description of how to perform such robust linearleast squares regression is described in: R. Dutter and P. J. Huber.“Numerical methods for the nonlinear robust regression problem.” Journalof Statistical and Computational Simulation, 13:79-113, 1981.

As conceived and illustrated in FIG. 4, the present invention disclosesinnovations beyond the RANSAC algorithm in the form of alterations ofthe algorithm that involve the initial sampling of finite differences(samples) and least squares estimation of a linear model. Synthesiserror is assessed for all samples in the general population using thesolved linear model. A rank is assigned to the linear model based on thenumber of samples whose residual conforms to a preset threshold. Thisrank is considered the “candidate consensus”.

The initial sampling, solving, and ranking are performed iterativelyuntil termination criteria are satisfied. Once the criteria aresatisfied, the linear model with the greatest rank is considered to bethe final consensus of the population.

An option refinement step involves iteratively analyzing subsets ofsamples in the order of best fit to the candidate model, and increasingthe subset size until adding one more sample would exceed a residualerror threshold for the whole subset.

As shown in FIG. 4, The Global Model Estimation process (450) isiterated until the Consensus Rank Acceptability test is satisfied (452).When the rank has not been achieved, the population of finitedifferences (404) is sorted relative to the discovered model in aneffort to reveal the linear model. The best (highest rank) motion modelis added to a solution set in process 460. Then the model isre-estimated in process 470. Upon completion, the population (404) isre-sorted.

The described non-limiting embodiments of the invention can be furthergeneralized as a general method of sampling a vector space, describedabove as a field of finite difference vectors, in order to determinesubspace manifolds in another parameter vector space that wouldcorrespond to a particular linear model.

A further result of the global registration process is that thedifference between this and the local registration process yields alocal registration residual. This residual is the error of the globalmodel in approximating the local model.

Normalization

Normalization refers to the resampling of spatial intensity fieldstowards a standard, or common, spatial configuration. When theserelative spatial configurations are invertible spatial transformationsbetween such configurations the resampling and accompanyinginterpolation of pels are also invertible up to a topological limit. Thenormalization method of the present invention is illustrated in FIG. 5.

When more than two spatial intensity fields are normalized, increasedcomputational efficiency may be achieved by preserving intermediatenormalization calculations.

Spatial transformation models used to resample images for the purpose ofregistration, or equivalently for normalization, include global andlocal models. Global models are of increasing order from translationalto projective. Local models are finite differences that imply aninterpolant on a neighborhood of pels as determined basically by a blockor more complexly by a piece-wise linear mesh.

Interpolation of original intensity fields to normalized intensity fieldincreases linearity of PCA appearance models based on subsets of theintensity field.

As shown in FIG. 2, the object pels (232 & 234) can be re-sampled (240)to yield a normalized version of the object pels (242 & 244).

Mesh-Based Normalization

A further embodiment of the present invention tessellates the featurepoints into a triangle based mesh, the vertices of the mesh are tracked,and the relative positions of each triangle's vertices are used toestimate the three-dimensional surface normal for the plane coincidentwith those three vertices. When the surface normal is coincident withthe projective axis of the camera, the imaged pels can provide aleast-distorted rendering of the object corresponding to the triangle.Creating a normalized image that tends to favor the orthogonal surfacenormal can produce a pel preserving intermediate data type that willincrease the linearity of subsequent appearance-based PCA models.

Another embodiment utilizes conventional block-based motion estimationto implicitly model a global motion model. In one, non-limitingembodiment, the method factors a global affine motion model from themotion vectors described by the conventional block-based motionestimation/prediction.

The present inventive method utilizes one or more global motionestimation techniques including the linear solution to a set of affineprojective equations. Other projective models and solution methods aredescribed in the prior art.

FIG. 9 illustrates the method of combining global and localnormalization.

Progressive Geometric Normalization

Classification of spatial discontinuities is used to align tessellatedmesh in order to model discontinuities implicitly as they are coincidentwith mesh edges.

Homogeneous region boundaries are approximated by a polygon contour. Thecontour is successively approximated at successively lower precision inorder to determine the saliency priority of each polygon vertex. Vertexpriority is propagated across regions in order to preserve vertexpriority for shared vertices.

In one embodiment of this invention, a polygon decomposition methodallows prioritization of boundaries associated with a homogeneousclassification of a field. Pels are classified according to somehomogeneity criteria, such as spectral similarity, and thenclassification labels are spatially connected into regions. In a furtherpreferred non-limiting embodiment, 4- or 8-connectedness criteria areapplied to determine spatial connectedness.

In a preferred embodiment, the boundaries of these spatial regions arethen discredited into a polygon. The spatial overlay of all the polygonsfor all the homogeneous regions are then tessellated and joined togetherinto a preliminary mesh. The vertices of this mesh are decomposed usingseveral criteria, to reveal simpler mesh representations that retainmuch of the perceptive saliency of the original mesh.

In a preferred embodiment, an image registration method, as disclosed inanother part of this specification, is biased towards these highpriority vertices with strong image gradients. Resulting deformationmodels tend to preserve spatial discontinuities associated with thegeometry of the imaged object.

In a preferred embodiment, active contours are used to refine regionboundaries. The active contour for each polygon region is allowed topropagate one iteration. The “deformation” or motion of each activecontour vertex in different regions is combined in an averagingoperation to allow for a constrained propagation of the implied mesh forwhich they all have membership.

In a preferred embodiment, vertices are assigned a count of the numberof adjacent vertices it has in the mesh for adjacent vertices that arealso part of the contour of a different region. These other vertices aredefined as being in opposition. In the case of a vertex having a countof 1, then it has no opposing vertex, and thus needs to be preserved. Ifa 2 adjacent opposing vertices both have a count of 1 (meaning thatthese 2 vertices are in different polygons, and are adjacent to eachother), then one vertex is resolved to the other. When a vertex of 1opposes a neighboring polygon vertex that has a value of 2, then vertexwith a count of 1 is resolved into the vertex with a count of 2, andthat vertex count goes to 1. So if another neighboring opposing vertexis present, then this vertex can be resolved again. For this case, it isimportant to save the original vertex count, so that when a vertex isresolved, we can bias the direction of resolving based on the originalvertex count. This is so that vertex a gets resolved to vertex b, thenvertex b, won't get resolved to vertex c, instead vertex c should getresolved to vertex b since b has been used already in one resolution.

In a preferred embodiment, T-junction points are processed specifically.These are points in polygon that have no point in the adjacent polygon.In this case, each polygon vertex is first plotted on a image point map,this map identifies the spatial position of the vertex and its polygonidentifier. Then each polygon perimeter is traversed, and tested to seeif there are any adjacent vertices from another polygon. If there areneighboring vertices from another region, then they are each tested tosee if they already have a neighboring vertex from the current polygon.If they don't then the current point is added as vertex of the currentpolygon. This extra test ensures that isolated vertices in anotherpolygon are used to generate the T-junction points. Otherwise, thiswould just add new vertices where this region already had a matchingvertex. So an opposing vertex is added only if the neighboring vertex isnot opposed by this current region. In a further embodiment, theefficiency of detecting T-junctions is increased through employing amask image. The polygons vertices are visited sequentially, and the maskis updated such that the pels of the vertices are identified asbelonging to a polygon vertex. Then the polygon perimeter pels aretraversed and if they coincide with a polygon vertex, then they arerecorded as a vertex within the current polygon.

In a preferred embodiment, when a spectral region has been remapped byone or more overlapping homogenous image gradient regions, and anotherhomogenous spectral region also overlaps, then all of the regions thatwere remapped previously are given the same label as those regions thatare currently being remapped. So in essence, if a spectral region isoverlapped by two homogenous regions, then all of the spectral regionsthat are overlapped by those two homogenous regions will get the samelabel, thus it is like that the one spectral region is really covered byone homogenous region instead of the two homogenous regions.

In one embodiment of the invention, it is advantageous to process regionmaps rather than region lists for the purpose of finding adjacency mergecriteria. In a further embodiment, the spectral segmentation classifiercan be modified to train the classifier using non-homogenous regions.This allows the processing to focus on the edges of the spectralregions. Additionally, adding different segmentation based on usingedges, such as the canny edge detector, and then feeding that to activecontour to identify the initial set of polygons allows for greaterdiscrimination of homogeneous regions.

Local Normalization

The present invention provides a means by which pels in thespatiotemporal stream can be registered in a ‘local’ manner.

One such localized method employs the spatial application of a geometricmesh to provide a means of analyzing the pels such that localizedcoherency in the imaged phenomena are accounted for when resolving theapparent image brightness constancy ambiguities in relation to the localdeformation of the imaged phenomena, or specifically an imaged object.

Such a mesh is employed to provide a piece-wise linear model of surfacedeformation in the image plane as a means of local normalization. Theimaged phenomena may often correspond to such a model when the temporalresolution of the video stream is high compared with the motion in thevideo. Exceptions to the model assumptions are handled through a varietyof techniques, including: topological constraints, neighbor vertexrestrictions, and analysis of homogeneity of pel and image gradientregions.

In one embodiment, feature points are used to generate a meshconstituted of triangular elements whose vertices correspond to thefeature points. The corresponding feature points is other frames implyan interpolated “warping” of the triangles, and correspondingly thepels, to generate a local deformation model.

FIG. 7 illustrates the generation of such an object mesh. FIG. 8illustrates the use of such an object mesh to locally normalize frames.

In one preferred embodiment, a triangle map is generated whichidentifies the triangle that each pel of the map comes from. Further,the affine transform corresponding to each triangle is pre-computed asan optimization step. And further, when creating the local deformationmodel, the anchor image (previous) is traversed using the spatialcoordinates to determine the coordinates of the source pel to sample.This sampled pel will replace the current pel location.

In another embodiment, local deformation is preformed after globaldeformation. In a previously disclosed specification above, GlobalNormalization was described as the process by which a GlobalRegistration method is used to spatially normalize pels in two or moreframes of video. The resulting globally normalized video frames canfurther be locally normalized. The combination of these two methodsconstrains the local normalization to a refinement of the globallyarrived at solution. This can greatly reduce the ambiguity that thelocal method is required to resolve.

In another non-limiting embodiment, feature points, or in the case of a“regular mesh”—vertex points, are qualified through analysis of theimage gradient in the neighborhood of those points. This image gradientcan be calculated directly, or through some indirect calculation such asa Harris response. Additionally, these points can be filtered by aspatial constraint and motion estimation error associated with a descentof the image gradient. The qualified points can be used as the basis fora mesh by one of many tessellation techniques, resulting in a mesh whoseelements are triangles. For each triangle, an affine model is generatedbased on the points and their residual motion vector.

The present inventive method utilizes one or more image intensitygradient analysis methods, including the Harris response. Other imageintensity gradient analysis methods are described in the prior art.

In a preferred embodiment, a list of the triangles affine parameters ismaintained. The list is iterated and a current/previous point list isconstructed (using the a vertex look up map). The current/previous pointlist is passed to a routine that is used to estimate the transform,which computes the affine parameters for that triangle. The affineparameters, or model, are then saved in the triangle affine parameterlist.

In a further embodiment, the method traverses a triangle identifierimage map, where each pel in the map contains the identifier for thetriangle in the mesh for which the pel has membership. And for each pelthat belongs to a triangle, the corresponding global deformation, andlocal deformation coordinates for that pel are calculated. Thosecoordinates, in turn, are used to sample the corresponding pel and toapply its value in the corresponding “normalize” position.

In a further embodiment, spatial constraints are applied to the pointsbased on density and the image intensity correspondence strengthresulting from the search of the image gradient. The points are sortedafter motion estimation is done based on some norm of the imageintensity residual. Then the points are filtered based on a spatialdensity constraint.

In a further embodiment, spectral spatial segmentation is employed, andsmall homogeneous spectral regions are merged based on spatial affinity,similarity of their intensity and/or color, with neighboring regions.Then homogenous merging is used to combine spectral regions togetherbased on their overlap with a region of homogenous texture (imagegradient). A further embodiment then uses center-surround points, thosewere a small region is surrounded by a larger region, as qualifiedinterest points for the purpose of supporting a vertex point of themesh. In a further non-limiting embodiment, a center surround point isdefined as a region whose bounding box is within one pel of being 3×3 or5×5 or 7×7 pels in dimension, and the spatial image gradient for thatbounding box is a corner shape. The center of the region can beclassified as a corner, further qualifying that position as anadvantageous vertex position.

In a further embodiment, the horizontal and vertical pel finitedifference images are used to classify the strength of each mesh edge.If an edge has many finite differences coincident with its spatialposition, then the edge, and hence the vertices of that edge areconsidered to be highly critical to the local deformation of the imagedphenomena. If there is a large derivative difference between theaverages of the sums of the finite differences of the edge, then mostlylikely the region edge corresponds to a texture change edge, and not aquantization step.

In a further embodiment, a spatial density model termination conditionis employed to optimize the processing of the mesh vertices. When asufficient number of points have been examined that covers most of thespatial area of an outset of the detection rectangle, then theprocessing can be terminated. The termination generates a score. Vertexand feature points entering the processing are sorted by this score. Ifthe point is too spatially close to an existing point, or if the pointdoes not correspond to an edge in the image gradient, then it isdiscarded. Otherwise, the image gradient in the neighborhood of thepoint is descended, and if the residual of the gradient exceeds a limit,then that point is also discarded.

In a preferred embodiment, the local deformation modeling is performediteratively, converging on a solution as the vertex displacements periteration diminish.

In another embodiment, local deformation modeling is performed, and themodel parameters are discarded if the global deformation has alreadyprovided the same normalization benefit.

Regular Mesh Normalization

The present invention extends the aforementioned Local Normalizationmethod utilizing a regular mesh. This mesh is constructed without regardto the underlying pels, yet it is positioned and sized corresponding toa detected object.

Given a detected object region, a spatial frame position and a scaleindicating the size of the face, generate a regular mesh over an outsetof the face region. In a preferred embodiment, use a non-overlapping setof tiles to delineate a rectangular mesh and then perform a diagonalpartitioning of the tiles to yield a regular mesh having triangular meshelements. In a further preferred embodiment, tiles are proportional tothose used in conventional video compression algorithms (e.g. MPEG-4AVC).

In a preferred embodiment, Vertices associated with the aforementionedmesh are prioritized through analysis of the pel regions surroundingthese vertices in specific frames of the video used for training.Analysis of the gradient of such regions provides a confidence regardingprocessing associated with each vertex that would rely on the localimage gradient (such as block-based motion estimation).

Correspondences of vertex positions in multiple frames are found througha simple descent of the image gradient. In a preferred embodiment thisis achieved through block-based motion estimates. In the presentembodiment high confidence vertices allow for high confidencecorrespondences. Lower confidence vertex correspondences are arrived atimplicitly through resolving ambiguous image gradients through inferencefrom higher confidence vertex correspondences.

In one preferred embodiment, a regular mesh is made over the outsettracking rectangle. Tiles are created 16×16, and are cut diagonally, toform a triangular mesh. The vertices of these triangles are motionestimated. The motion estimation depends on the type of texture thateach point has. The texture is divided into three classes, corner, edge,and homogenous, which also defines the order of processing of thevertices. A corner vertex uses neighboring vertex estimation, i.e. themotion estimates of the neighboring points (if available) are used forpredictive motion vectors, and motion estimation is applied to each one.The motion vector that provides the lowest mad error is used as thisvertex motion vector. The search strategy used for the corner is all(wide, small, and origin). For edges, again the nearest neighbor motionvectors are used as predictive motion vectors, and the one with theleast amount of error is used. The search strategy for edges is smalland origin. For homogenous the neighboring vertices are searched and themotion estimate with the lowest error is used.

In one preferred embodiment, the image gradient for each triangle vertexis calculated, and sorted based on the class and magnitude. So cornersare before edges, which are before homogenous. For corners, strongcorners are before weak corners, and for edges, strong edges are beforeweak edges.

In one preferred embodiment, the local deformation for each triangle isbased on a motion estimate associated with that triangle. Each trianglehas an affine estimated for it. If the triangle doesn't topologicallyinvert, or become degenerate, then the pels that are part of thetriangle are used to sample the current image, based on the estimateaffine obtained.

Segmentation

The spatial discontinuities identified through the further describedsegmentation processes are encoded efficiently through geometricparameterization of their respective boundaries, referred to as spatialdiscontinuity models. These spatial discontinuity models may be encodedin a progressive manner allowing for ever more concise boundarydescriptions corresponding to subsets of the encoding. Progressiveencoding provides a robust means of prioritizing the spatial geometrywhile retaining much of the salient aspects of the spatialdiscontinuities.

A preferred embodiment of the present invention combines amulti-resolution segmentation analysis with the gradient analysis of thespatial intensity field and further employs a temporal stabilityconstraint in order to achieve a robust segmentation.

As shown in FIG. 2, once the correspondences of feature of an objecthave been tracked over time (220) and modeled (224), adherence to thismotion/deformation model can be used to segment the pels correspondingto the object (230). This process can be repeated for a multitude ofdetected objects (206 & 208) in the video (202 & 204). The results ofthis processing are the segmented object pels (232).

One form of invariant feature analysis employed by the present inventionis focused on the identification of spatial discontinuities. Thesediscontinuities manifest as edges, shadows, occlusions, lines, corners,or any other visible characteristic that causes an abrupt andidentifiable separation between pels in one or more imaged frames ofvideo. Additionally, subtle spatial discontinuities between similarlycolored and/or textured objects may only manifest when the pels of theobjects in the video frame are undergoing coherent motion relative tothe objects themselves, but different motion relative to each other. Thepresent invention utilizes a combination of spectral, texture, andmotion segmentation to robustly identify the spatial discontinuitiesassociated with a salient signal mode.

Temporal Segmentation

The temporal integration of translational motion vectors, orequivalently finite difference measurements in the spatial intensityfield, into a higher-order motion model is a form of motion segmentationthat is described in the prior art.

In one embodiment of the invention, a dense field of motion vectors isproduced representing the finite differences of object motion in thevideo. These derivatives are grouped together spatially through aregular partitioning of tiles or by some initialization procedure suchas spatial segmentation. The “derivatives” of each group are integratedinto a higher order motion model using a linear least squares estimator.The resulting motion models are then clustered as vectors in the motionmodel space using the k-means clustering technique. The derivatives areclassified based on which cluster best fits them. The cluster labels arethen spatially clustered as an evolution of the spatial partitioning.The process is continued until the spatial partitioning is stable.

In a further embodiment of the invention, motion vectors for a givenaperture are interpolated to a set of pel positions corresponding to theaperture. When the block defined by this interpolation spans pelscorresponding to an object boundary, the resulting classification issome anomalous diagonal partitioning of the block.

In the prior art, the least squares estimator used to integrate thederivatives is highly sensitive to outliers. The sensitivity cangenerate motion models that heavily bias the motion model clusteringmethod to the point that the iterations diverge widely.

In the present invention the motion segmentation methods identifyspatial discontinuities through analysis of apparent pel motion over twoor more frames of video. The apparent motion is analyzed for consistencyover the frames of video and integrated into parametric motion models.Spatial discontinuities associated with such consistent motion areidentified. Motion segmentation can also be referred to as temporalsegmentation, because temporal changes may be caused by motion. However,temporal changes may also be caused by some other phenomena such aslocal deformation, illumination changes, etc.

Through the described method, the salient signal mode that correspondsto the normalization method can be identified and separated from theambient signal mode (background or non-object) through one of severalbackground subtraction methods. Often, these methods statistically modelthe background as the pels that exhibit the least amount of change ateach time instance. Change can be characterized as a pel valuedifference.

Segmentation perimeter-based global deformation modeling is achieved bycreating a perimeter around the object, then collapsing the perimetertoward the detected center of the object until perimeter vertices haveachieved a position coincident with a heterogeneous image gradient.Motion estimates are gathered for these new vertex positions, and robustaffine estimation is used to find the global deformation model.

Integration of segmented mesh vertex image gradient descent-based finitedifferences into global deformation model.

Object Segmentation

The block diagram shown in FIG. 13 shows one preferred embodiment ofobject segmentation. The process shown begins with an ensemble ofnormalized images (1302) that are then pair-wise differenced (1304)among the ensemble. These differences are then element-wise accumulated(1306) into an accumulation buffer. The accumulation buffer isthresholded (1310) in order to identify the more significant errorregions. The thresholded element mask is then morphologically analyzed(1312) in order to determine the spatial support of the acculated errorregions (1310). The resulting extraction (1314) of the morphologicalanalysis (1312) is then compared with the detected object position(1320) in order to focus subsequent processing on accumulated errorregions that are coincident with the object. The isolated spatialregion's (1320) boundary is then approximated with a polygon (1322) ofwhich a convex hull is generated (1324). The contour of the hull is thenadjusted (1332) in order to better initialize the vertices' positionsfor active contour analysis (1332). Once the active contour analysis(1332) has converged on a low energy solution in the accumulated errorspace, the contour is used as the final contour (1334) and the pelsconstrained in the contour are considered those that are most likelyobject pels, and those pels outside of the contour are considered to benon-object pels.

In a preferred embodiment, motion segmentation can be achieved given thedetected position and scale of the salient image mode. A distancetransform can be used to determine the distance of every pel from thedetected position. If the pel values associated with the maximumdistance are retained, a reasonable model of the background can beresolved. In other words, the ambient signal is re-sampled temporallyusing a signal difference metric.

A further embodiment includes employing a distance transform relative tothe current detection position to assign a distance to each pel. If thedistance to a pel is greater than the distance in some maximum peldistance table, then the pel value is recorded. After a suitabletraining period, the pel is assumed to have the highest probability ofbeing a background pel if the maximum distance for that pel is large.

Given a model of the ambient signal, the complete salient signal mode ateach time instance can be differenced. Each of these differences can bere-sampled into spatially normalized signal differences (absolutedifferences). These differences are then aligned relative to each otherand accumulated. Since these differences have been spatially normalizedrelative to the salient signal mode, peaks of difference will mostlycorrespond to pel positions that are associated with the salient signalmode.

In one embodiment of the invention, a training period is defined whereobject detection positions are determined and a centroid of thosepositions is used to determine optimal frame numbers with detectionpositions far from this position that would allow for frame differencingto yield background pels that would have the highest probability ofbeing non-object pels.

In one embodiment of the present invention, active contour modeling usedto segment the foreground object from the non-object background bydetermining contour vertex positions in accumulated error “image”. In apreferred embodiment the active contour edges are subdividedcommensurate with the scale of the detected object to yield a greaterdegree of freedom. In a preferred embodiment, the final contourpositions can be snapped to a nearest regular mesh vertex in order toyield a regularly spaced contour.

In one non-limiting embodiment of object segmentation, an orientedkernel is employed for generating error image filter responses fortemporally pair-wise images. Response to the filter that is orientedorthogonal to the gross motion direction tends to enhance the errorsurface when motion relative to the background occurs from occlusion andrevealing of the background.

The normalized image frame intensity vectors of an ensemble ofnormalized images are differenced from one or more reference framecreating residual vectors. These residual vectors are accumulatedelement-wise to form an accumulated residual vector. This accumulatedresidual vector is then probed spatially in order to define a spatialobject boundary for spatial segmentation of the object and non-objectpels.

In one preferred embodiment, an initial statistical analysis of theaccumulated residual vector is performed to arrive at a statisticalthreshold value that can be used to threshold the accumulated residualvector. Through an erosion and subsequent dilation morphologicaloperation, a preliminary object region mask is created. The contourpolygon points of the region are then analyzed to reveal the convex hullof those points. The convex hull is then used as an initial contour foran active contour analysis method. The active contour is the propagateduntil it converges on the spatial boundaries of the object's accumulatedresidual. In a further preferred embodiment, the preliminary contour'sedges are further subdivided by adding midpoint vertices until a minimaledge length is achieved for all the edge lengths. This furtherembodiment is meant to increase the degrees of freedom of the activecontour model to more accurately fit the outline of the object.

In a preferred embodiment, the refined contour is used to generate a pelmask indicating the pels of the object by overlaying the polygon impliedby the contour and overlaying the polygon in the normalized images.

Resolution of Non-Object

The block diagram shown in FIG. 12 discloses one preferred embodiment ofnon-object segmentation, or equivalently background resolution. With theinitialization of a background buffer (1206) and an initial maximumdistance value (1204) buffer, the process works to determine the moststable non-object pels by associating “stability” with the greatestdistance from the detected object position (1202). Given a new detectedobject position (1202), the process checks each pel position (1210). Foreach pel position (1210), the distance from the detected object position(1210) is calculated using a distance transform. If the distance forthat pel is greater (1216) than the previously stored position in themaximum distance buffer (1204) then the previous value is replace withthe current value (1218) and the pel value is recorded (1220) in the pelbuffer.

Given a resolved background image, the error between this image and thecurrent frame can be normalized spatially and accumulated temporally.Such a resolved background image is described in the “backgroundresolution” section. The resolution of the background through thismethod is considered a time-based occlusion filter process.

The resulting accumulated error is then thresholded to provide aninitial contour. The contour is then propagated spatially to balanceerror residual against contour deformation.

In an alternative embodiment, absolute differences between the currentframe and the resolved background frames is computed. The element-wiseabsolute difference is then segmented into distinct spatial regions.These regions bounding boxes average pel value is computed, so that whenthe resolved background is updated, the difference between the currentand resolved background average pel value can be used to perform acontrast shift, so that the current region can blend in more effectivelywith the resolved background. In another embodiment, the vertices withinthe normalized frame mask are motion estimated and saved for each frame.These are then processed using SVD to generate a local deformationprediction for each of the frames.

Gradient Segmentation

The texture segmentation methods, or equivalently, intensity gradientsegmentation, analyze the local gradient of the pels in one or moreframes of video. The gradient response is a statistical measure whichcharacterizes the spatial discontinuities local to a pel position in thevideo frame. One of several spatial clustering techniques is then usedto combine the gradient responses into spatial regions. The boundariesof these regions are useful in identifying spatial discontinuities inone or more of the video frames.

In one embodiment of the invention, the summed area table concept fromcomputer graphics texture generation is employed for the purpose ofexpediting the calculation of the gradient of the intensity field. Afield of progressively summed values is generated facilitating thesummation of any rectangle of the original field through four lookupscombined with four addition operations.

A further embodiment employs the Harris response which is generated foran image and the neighborhood of each pel is classified as being eitherhomogeneous, an edge, or a corner. A response value is generated fromthis information and indicates the degree of edge-ness or cornered-nessfor each element in the frame.

Multi-Scale Gradient Analysis

An embodiment of the present invention further constrains the imagegradient support by generating the image gradient values through severalspatial scales. This method can help qualify the image gradient suchthat spatial discontinuities at different scales are used to supporteach other—as long as an “edge” is discriminated at several differentspatial scales, the edge should be “salient”. A more qualified imagegradient will tend to correspond to a more salient feature.

In a preferred embodiment, the texture response field is firstgenerated, the values of this field are then quantized into several binsbased on a k-means binning/partitioning. The original image gradientvalues are then progressively processed using each bin as an interval ofvalues to which a single iteration can apply watershed segmentation. Thebenefit of such an approach is that homogeneity is defined in a relativesense with a strong spatial bias.

Spectral Segmentation

The spectral segmentation methods analyze the statistical probabilitydistribution of the black and white, grayscale, or color pels in thevideo signal. A spectral classifier is constructed by performingclustering operations on the probability distribution of those pels. Theclassifier is then used to classify one or more pels as belonging to aprobability class. The resulting probability class and its pels are thengiven a class label. These class labels are then spatially associatedinto regions of pels with distinct boundaries. These boundaries identifyspatial discontinuities in one or more of the video frames.

The present invention may utilize spatial segmentation based on spectralclassification to segment pels in frames of the video. Further,correspondence between regions may be determined based on overlap ofspectral regions with regions in previous segmentations.

It is observed that when video frames are roughly made up of continuouscolor regions that are spatially connected into larger regions thatcorrespond to objects in the video frame, identification and tracking ofthe colored (or spectral) regions can facilitate the subsequentsegmentation of objects in a video sequence.

Background Segmentation

The described invention includes a method for video frame backgroundmodeling that is based on the temporal maximum of spatial distancemeasurements between a detected object and each individual pel in eachframe of video. Given the detected position of the object, the distancetransformation is applied, creating a scalar distance value for each pelin the frame. A map of the maximum distance over all of the video framesfor each pel is retained. When the maximum value is initially assigned,or subsequently updated with a new and different value, thecorresponding pel for that video frame is retained in a “resolvedbackground” frame.

Appearance Modeling

A common goal of video processing is often to model and preserve theappearance of a sequence of video frames. The present invention is aimedat allowing constrained appearance modeling techniques to be applied inrobust and widely applicable ways through the use of preprocessing. Theregistration, segmentation, and normalization described previously areexpressly for this purpose.

The present invention discloses a means of appearance variance modeling.The primary basis of the appearance variance modeling is, in the case ofa linear model, the analysis of feature vectors to reveal compact basisexploiting linear correlations. Feature vectors representing spatialintensity field pels can be assembled into an appearance variance model.

In an alternative embodiment, the appearance variance model iscalculated from a segmented subset of the pels. Further, the featurevector can be separated into spatially non-overlapping feature vectors.Such spatial decomposition may be achieved with a spatial tiling.Computational efficiency may be achieved through processing thesetemporal ensembles without sacrificing the dimensionality reduction ofthe more global PCA method.

When generating an appearance variance model, spatial intensity fieldnormalization can be employed to decrease PCA modeling of spatialtransformations.

Deformation Modeling

Local deformation can be modeled as vertex displacements and aninterpolation function can be used to determine the resampling of pelsaccording to vertices that are associated with those pels. These vertexdisplacements may provide a large amount of variation in motion whenlooked at as a single parameter set across many vertices. Correlationsin these parameters can greatly reduce the dimensionality of thisparameter space.

PCA

The preferred means of generating an appearance variance model isthrough the assembly of frames of video as pattern vectors into atraining matrix, or ensemble, and application of Principal ComponentAnalysis (PCA) on the training matrix. When such an expansion istruncated, the resulting PCA transformation matrix is employed toanalyze and synthesize subsequent frames of video. Based on the level oftruncation, varying levels of quality of the original appearance of thepels can be achieved.

The specific means of construction and decomposition of the patternvectors is well known to one skilled in the art.

Given the spatial segmentation of the salient signal mode from theambient signal and the spatial normalization of this mode, the pelsthemselves, or equivalently, the appearance of the resulting normalizedsignal, can be factored into linearly correlated components with a lowrank parameterization allowing for a direct trade-off betweenapproximation error and bit-rate for the representation of the pelappearance. One method for achieving a low rank approximation is throughthe truncation of bytes and/or bits of encoded data. A low rankapproximation is considered a compression of the original data asdetermined by the specific application of this technique. For example,in video compression, if the truncation of data does not unduly degradethe perceptual quality then the application specific goal is achievedalong with compression.

As shown in FIG. 2, the normalized object pels (242 & 244) can beprojected into a vector space and the linear correspondences can bemodeled using a decomposition process (250) such as PCA in order toyield a dimensionally concise version of the data (252 & 254).

Sequential PCA

PCA encodes patterns into PCA coefficients using a PCA transform. Thebetter the patterns are represented by the PCA transform, the fewercoefficients are needed to encode the pattern. Recognizing that patternvectors may degrade as time passes between acquisition of the trainingpatterns and the patterns to be encoded, updating the transform can helpto counter act the degradation. As an alternative to generating a newtransform, sequential updating of existing patterns is morecomputationally efficient in certain cases.

Many state-of-the-art video compression algorithms predict a frame ofvideo from one or more other frames. The prediction model is commonlybased on a partitioning of each predicted frame into non-overlappingtiles which are matched to a corresponding patch in another frame and anassociated translational displacement parameterized by an offset motionvector. This spatial displacement, optionally coupled with a frameindex, provides the “motion predicted” version of the tile. If the errorof the prediction is below a certain threshold, the tile's pels aresuitable for residual encoding; and there is a corresponding gain incompression efficiency. Otherwise, the tile's pels are encoded directly.This type of tile-based, alternatively termed block-based, motionprediction method models the video by translating tiles containing pels.When the imaged phenomena in the video adheres to this type of modeling,the corresponding encoding efficiency increases. This modelingconstraint assumes a certain level of temporal resolution, or number offrames per second, is present for imaged objects undergoing motion inorder to conform to the translational assumption inherent in block-basedprediction. Another requirement for this translational model is that thespatial displacement for a certain temporal resolution must be limited;that is, the time difference between the frames from which theprediction is derived and the frame being predicted must be a relativelyshort amount of absolute time. These temporal resolution and motionlimitations facilitate the identification and modeling of certainredundant video signal components that are present in the video stream.

In the present inventive method, sequential PCA is combined withembedded zero-tree wavelet to further enhance the utility of the hybridcompression method. The Sequential PCA technique provides a means bywhich conventional PCA can be enhanced for signals that have a temporalcoherency or temporally local smoothness. The embedded zero-tree waveletprovides a means by which a locally smooth spatial signal can bedecomposed into a space-scale representation in order to increase therobustness of certain processing and also the computational efficiencyof the algorithm. For the present invention, these two techniques arecombined to increase the representation power of the variance models andalso provide a representation of those models that is compact andordered such that much of the representational power of the basis isprovided by a truncation of the basis.

In another embodiment, sequential PCA is applied with a fixed inputblock size and fixed tolerance to increase the weighted bias to thefirst and most energetic PCA components. For longer data sequences thisfirst PCA component is often the only PCA component. This affects thevisual quality of the reconstruction and can limit the utility of thedescribed approach in some ways. The present invention employs adifferent norm for the selection of PCA components that is preferable tothe use of the conventionally used least-square norm. This form of modelselection avoids the over-approximation by the first PCA component.

In another embodiment, a block PCA process with a fixed input block sizeand prescribed number of PCA components per data block is employed toprovide beneficial uniform reconstruction traded against usingrelatively more components. In a further embodiment, the block PCA isused in combination with sequential PCA, where block PCA reinitializesthe sequential PCA after a set number of steps with a block PCA step.This provides a beneficial uniform approximation with a reduction in thenumber of PCA components.

In another embodiment, the invention capitalizes on the situation wherethe PCA components before and after encoding-decoding are visuallysimilar. The quality of the image sequence reconstructions before andafter encoding-decoding may also be visually similar and this oftendepends on the degree of quantization employed. The present inventivemethod decodes the PCA components and then renormalizes them to have aunit norm. For moderate quantization the decoded PCA components areapproximately orthogonal. At a higher level of quantization the decodedPCA components are partially restored by application of SVD to obtain anorthogonal basis and modified set of reconstruction coefficients.

In another embodiment, a variable and adaptable block size is appliedwith a hybrid sequential PCA method in order to produce improved resultswith regard to synthesis quality. The present invention bases the blocksize on a maximum number of PCA components and a given error tolerancefor those blocks. Then, the method expands the current block size untilthe maximum number of PCA components is reached. In a furtherembodiment, the sequence of PCA components is considered as a datastream, which leads to a further reduction in the dimensionality. Themethod performs a post-processing step where the variable data blocksare collected for the first PCA component from each block and SVD isapplied to further reduce the dimensionality. The same process is thenapplied to the collection of second, third, etc components.

Symetric Decomposition

In one embodiment of the invention, a decomposition is performed basedon a symmetric ensemble. This ensemble represents a square image as thesum of six orthogonal components. Each component corresponds to adifferent symmetry of the square. By symmetry, each orthogonal componentis determined by a “fundamental region” that is mapped by the action ofsymmetry into the complete component. The sum of the fundamental regionshas the same cardinality as the input image, assuming the input imageitself has no particular symmetry.

Residual-Based Decomposition

In MPEG video compression, the current frame is constructed by motioncompensating the previous frame using motion vectors, followed byapplication of a residual update for the compensation blocks, andfinally, any blocks that do not have a sufficient match are encoded asnew blocks.

The pels corresponding to residual blocks are mapped to pels in theprevious frame through the motion vector. The result is a temporal pathof pels through the video that can be synthesized through the successiveapplication of residual values. These pels are identified as ones thatcan be best represented using PCA.

Occlusion-Based Decomposition

A further enhancement of the invention determines if motion vectorsapplied to blocks will cause any pels from the previous frame to beoccluded (covered) by moving pels. For each occlusion event, split theoccluding pels into a new layer. There will also be revealed pelswithout a history. The revealed pels are placed onto any layer that willfit them in the current frame and for which a historical fit can be madefor that layer.

The temporal continuity of pels is supported through the splicing andgrafting of pels to different layers. Once a stable layer model isarrived at, the pels in each layer can be grouped based on membership tocoherent motion models.

Sub-Band Temporal Quantization

An alternative embodiment of the present invention uses discrete cosinetransform (DCT) or discrete wavelet transform (DWT) to decompose eachframe into sub-band images. Principal component analysis (PCA) is thenapplied to each of these “sub-band” videos. The concept is that sub-banddecomposition of a frame of video decreases the spatial variance in anyone of the sub-bands as compared with the original video frame.

For video of a moving object (person), the spatial variance tends todominate the variance modeled by PCA. Sub-band decomposition reduces thespatial variance in any one decomposition video.

For DCT, the decomposition coefficients for any one sub-band arearranged spatially into a sub-band video. For instance, the DCcoefficients are taken from each block and arranged into a sub-bandvideo that looks like a postage stamp version of the original video.This is repeated for all the other sub-bands, and the resulting sub-bandvideos are each processed using PCA.

For DWT, the sub-bands are already arranged in the manner described forDCT.

In a non-limiting embodiment, the truncation of the PCA coefficients isvaried.

Wavelet

When a data is decomposed using the discrete Wavelet transform (DWT),multiple band-pass data sets result at lower spatial resolutions. Thetransformation process can be recursively applied to the derived datauntil only single scalar values results. The scalar elements in thedecomposed structure are typically related in a hierarchicalparent/child fashion. The resulting data contains a multi resolutionhierarchical structure and also finite differences as well.

When DWT is applied to spatial intensity fields, many of the naturallyoccurring images' phenomena are represented with little perceptual lossby the first or second low band pass derived data structures due to thelow spatial frequency. Truncating the hierarchical structure provides acompact representation when high frequency spatial data is either notpresent or considered noise.

While PCA may be used to achieve accurate reconstruction with a smallnumber of coefficients, the transform itself can be quite large. Toreduce the size of this “initial” transform, an embedded zero tree (EZT)construction of a wavelet decomposition can be used to build aprogressively more accurate version of the transformation matrix.

Subspace Classification

As is well understood by those practiced in the art, discretely sampledphenomena data and derivative data can be represented as a set of datavectors corresponding to an algebraic vector space. These data vectorsinclude, in a non-limiting way, the pels in the normalized appearance ofthe segmented object, the motion parameters, and any structuralpositions of features or vertices in two or three dimensions. Each ofthese vectors exists in a vector space, and the analysis of the geometryof the space can be used to yield concise representations of thesampled, or parameter, vectors. Beneficial geometric conditions aretypified by parameter vectors that form compact subspaces. When one ormore subspaces are mixed, creating a seemingly more complex singlesubspace, the constituent subspaces can be difficult to discern. Thereare several methods of segmentation that allow for the separation ofsuch subspaces through examining the data in a higher dimensional vectorspace that is created through some interaction of the original vectors(such as inner product).

One method of segmenting the vector space involves the projection of thevectors into a Veronese vector space representing polynomials. Thismethod is well known in the prior art as the Generalized PCA or GPCAtechnique. Through such a projection, the normals to the polynomials arefound, grouped, and the original vectors associated with those normalscan be grouped together. An example of the utility of this technique isin the factoring of two dimensional spatial point correspondencestracked over time into a three dimensional structure model and themotion of that three dimensional model.

The GPCA technique is incomplete when applied as defined, yieldingresults only when the data vectors are generated with little noise. Theprior art assumes supervisory user intervention to guide the GPCAalgorithm. This constraint greatly limits the potential of thetechnique.

The present invention extends the conceptual basis of the GPCA method torobustly handle the identification and segmentation of multiplesubspaces in the presence of noise and mixed co-dimension. Thisinnovation provides an unsupervised improvement of the technique overthe state of the art.

In the prior art, GPCA operates on the normal vectors of the polynomialsof the Veronese map without regard to the tangent space of those normalvectors. The present inventive method extends GPCA to find the tangentspace orthogonal to the space of the normal vectors that are normallyfound in the Veronese map. This “tangent space”, or subspace of theVeronese map, is then used to factor the Veronese map.

The tangent space is identified through plane wave expansions and theapplication of the Legendre transformation between position and tangentplane coordinates which reveals dualities in the representation ofgeometric objects, specifically the tangents of the normals to thepolynomials of the Veronese Map. The discrete Legendre transformation isapplied through convex analysis to define a constrained form ofderivative corresponding to the normal vectors. This approach is used tosegment the data vectors by calculation of normal vectors in thepresence of noise. This convexity analysis is incorporated with GPCA toprovide a more robust algorithm.

The present invention capitalizes on an iterative factorization approachwhen applying GPCA. In particular, the derivative-based implementationfound in the prior art is extended to refine the ensemble of classifieddata vectors through the very same GPCA method described herein. Appliediteratively, this technique can be used to robustly find candidatenormal vectors in the Veronese mapping, and then further qualify thosevectors using this extended GPCA technique. For the factorization step,the original data associated with the refined set of vectors is removedfrom the original data set. The remaining data set can likewise beanalyzed with this innovated GPCA technique. This innovation is criticalto using the GPCA algorithm in an unsupervised manner. FIG. 11illustrates the recursive refinement of data vectors.

It is further recognized that the inventive extension to the GPCAtechnique has greater advantages in cases where there are multiple rootsin the Veronese polynomial vector space. Additionally, when the priorart technique encounters the degenerate case when normals in theVeronese map are parallel to a vector space axis, the present method isnot degenerate.

FIG. 10 illustrates the method of basic polynomial fitting anddifferentiation.

In a preferred embodiment, GPCA is implemented with polynomialdifferentiation for arbitrary co-dimension subspaces. SVD is used to getthe dimension of the normal space at each data point and clusters datapoint according to the normal space dimension. Within each cluster, datapoints are assigned to the same subspace when, to a tolerance, they allbelong to a maximal set with the same rank that is equal to the commonnormal space dimension. It is recognized that this method is optimal fordata that is free of noise.

Another non-limiting embodiment of GPCA with polynomial differentiationhas arbitrary co-dimension subspaces. This is an adaptation of the“polynomial differentiation” method. As noise tends to increase the rankof a set of nearly aligned normal vectors, the polynomial division stepis initialized by clustering data points according to the SVD dimensionand then selecting the point that has the smallest residual error in thecluster with the smallest co-dimension. The normal space at this pointis then applied with the polynomial division to approximately reduce theVeronese map.

In a further embodiment, the gradient weighted residual error isminimized over all data points and SVD is applied at the optimal pointto estimate co-dimension and basis vectors. The basis vectors are thenapplied with polynomial division to approximately reduce the Veronesemap.

In a preferred embodiment, the RCOP error is used to set numericaltolerances due to it scaling linearly with noise level. In a preferredembodiment, GPCA is implemented in such a way as to apply SVD to theestimated normal vectors at each point and identify the points whosenormal vector SVD has the same rank. Then a sequential SVD is applied toeach collection of normal vectors at the points with the same rank.Points where the sequential SVD changes rank are identified as differentsubspaces.

Hybrid Spatial Normalization Compression

The present invention extends the efficiency of block-based motionpredicted coding schemes through the addition of segmenting the videostream into two or more “normalized” streams. These streams are thenencoded separately to allow the conventional codec's translationalmotion assumptions to be valid. Upon decoding the normalized streams,the streams are de-normalized into their proper position and compositedtogether to yield the original video sequence.

In one embodiment, one or more objects are detected in the video streamand the pels associated with each individual object are subsequentlysegmented leaving non-object pels. Next, a global spatial motion modelis generated for the object and non-object pels. The global model isused to spatially normalize object and non-object pels. Such anormalization has effectively removed the non-translational motion fromthe video stream and has provided a set of videos whose occlusioninteraction has been minimized. These are both beneficial features ofthe present inventive method.

The new videos of object and the non-object, having their pels spatiallynormalized, are provided as input to a conventional block-basedcompression algorithm. Upon decoding of the videos, the global motionmodel parameters are used to de-normalize those decoded frames, and theobject pels are composited together and onto the non-object pels toyield an approximation of the original video stream.

As shown in FIG. 6, the previously detected object instances (206 &208)for one or more objects (630 & 650), are each processed with a separateinstance of a conventional video compression method (632). Additionally,the non-object (602) resulting from the segmentation (230) of theobjects, is also compressed using conventional video compression (632).The result of each of these separate compression encodings (632) areseparate conventional encoded streams for each (634) corresponding toeach video stream separately. At some point, possibly aftertransmission, these intermediate encoded streams (234) can bedecompressed (636) into a synthesis of the normalized non-object (610)and a multitude of objects (638 & 658). These synthesized pels can bede-normalized (640) into their de-normalized versions (622, 642 & 662)to correctly position the pels spatially relative to each other so thata compositing process (670) can combine the object and non-object pelsinto a synthesis of the full frame (672).

In a preferred embodiment, the switching between encoding modes isperformed based on a statistical distortion metric, such as PSNR, thatwould allow conventional versus the subspace method to encode the framesof video.

In another embodiment of the invention, the encoded parameters of theappearance, global deformation, and local deformation are interpolatedto yield predictions of intermediate frames that would not otherwisehave to be encoded. The interpolation method can be any of the standardinterpolation methods such as linear, cubic, spline, etc.

As shown in FIG. 14, the object interpolation method can be achievedthrough the interpolation analysis (1408) of a series of normalizedobjects (1402,1404, &1406) as represented by appearance and deformationparameters. The analysis determines the temporal range (1410) over whichan interpolating function can be applied. The range specification (1410)can then be combined with the normalized object specifications (1414 &1420) in order to approximate and ultimately synthesize the interimnormalized objects (1416 & 1418).

Integration of Hybrid Codec

In combining a conventional block-based compression algorithm and anormalization-segmentation scheme, as described in the presentinvention, there are several inventive methods that have resulted.Primarily, there are specialized data structures and communicationprotocols that are required.

The primary data structures include global spatial deformationparameters and object segmentation specification masks. The primarycommunication protocols are layers that include the transmission of theglobal spatial deformation parameters and object segmentationspecification masks.

1. A computer-implemented method of generating an encoded form of videosignal data from a plurality of video frames, the method comprising:detecting at least one object in the two or more video frames; trackingthe at least one object through the two or more frames of the videoframes; segmenting the pel data associated with the at least one objectfrom other pel data in the two or more video frames so as to generate asecond intermediate form of the data, the segmenting utilizing a spatialsegmentation of the pel data; and identifying corresponding elements ofat least one object in two or more of the video frames; analyzing thecorresponding elements to generate relationships between thecorresponding elements; generating correspondence models by using therelationships between the corresponding elements; integrating therelationships between the corresponding elements into a model of globalmotion; and re-sampling pel data associated with the at least one objectin the two or more video frames by utilizing the correspondence models,thereby generating re-sampled pel data, the re-sampled pel datarepresenting a first intermediate form of the data; and restoring thespatial positions of the re-sampled pel data by utilizing thecorrespondence models, thereby generating restored pels; and recombiningthe restored pels together with an associated portion of the secondintermediate form of the data to create an original video frame; andwherein no detection would indicate an indirect detection for the wholeframe; and wherein the detecting and tracking comprise using a facedetection algorithm; and wherein generating correspondence modelscomprises using a robust estimator for the solution of amulti-dimensional projective motion model, and wherein analyzing thecorresponding elements comprises using an appearance-based motionestimation between two or more of the video frames.
 2. The method ofclaim 1 comprising encoding the first intermediate form of the data, theencoding comprising; decomposing the re-sampled pel data into an encodedrepresentation, the encoded representation representing a thirdintermediate form of the data; and truncating zero or more bytes of theencoded representation; and recomposing the re-sampled pel data from theencoded representation; wherein each of the decomposing and therecomposing uses Principal Component Analysis.
 3. The method of claim 1comprising a method of factoring the correspondence models into globalmodels, the method comprising: integrating the relationships between thecorresponding elements into a model of global motion; decomposing there-sampled pel data into an encoded representation, the encodedrepresentation representing a fourth intermediate form of the data; andtruncating zero or more bytes of the encoded representation; andrecomposing the re-sampled pel data from the encoded representation;wherein each of the decomposing and the recomposing uses PrincipalComponent Analysis; wherein generating correspondence models comprisesusing a robust estimator for the solution of a multi-dimensionalprojective motion model, and wherein analyzing the correspondingelements comprises using a sampling population based on finitedifferences generated from a block-based motion estimation between twoor more of the video, frames.
 4. The method of claim 3 wherein each ofthe two or more video frames comprises object pels and non-object pels,the method comprising: identifying corresponding elements in thenon-object pels in two or more of the video frames: analyzing thecorresponding elements in the non-object pels to generate relationshipsbetween the corresponding elements in the non-object pels; generatingsecond correspondence models by using the relationships between thecorresponding elements in the non-object pels; wherein the analysis ofthe corresponding elements includes a time-based occlusion filter. 5.The method of claim 4 comprising: factoring the correspondence modelsinto global models; integrating the relationships between thecorresponding elements into a model of global motion; decomposing there-sampled pel data into an encoded representation, the encodedrepresentation representing a fifth intermediate form of the data; andtruncating zero or more bytes of the encoded representation; andrecomposing the re-sampled pel data from the encoded representation;wherein each of the decomposing and the recomposing uses a conventionalvideo compression/decompression process; wherein generatingcorrespondence models comprises using a robust estimator for thesolution of a multi-dimensional projective motion model, and whereinanalyzing the corresponding elements comprises using a samplingpopulation based on finite differences generated from a block-basedmotion estimation between two or more of the video frames.
 6. The methodof claim 4 comprising a method of factoring the correspondence modelsinto global models, the method comprising: (a) integrating therelationships between the corresponding elements into a model of globalmotion; (b) performing subspace segmentation on a sort of the datavectors; and (c) constraining subspace segmentation criteria throughapplication of a tangent vector analysis in an implicit vector space;(d) retaining a subset of the set of data vectors; (e) performing (b)and (c) on the subset of the set of data vectors; wherein performingsubspace segmentation comprises using GPCA; wherein the implicit vectorspace comprises the Veronese Map; and wherein the tangent vectoranalysis comprises the Legendre Transform; and after (a) through (e)have been performed, the method further comprising: (f) decomposing there-sampled pel data into an encoded representation, the encodedrepresentation representing a fourth intermediate form of the data; and(g) truncating zero or more bytes of the encoded representation; and (h)recomposing the re-sampled pel data from the encoded representation;wherein each of the decomposing and recomposing uses Principal ComponentAnalysis; wherein generating correspondence models comprises using arobust estimator for the solution of a multi-dimensional projectivemotion model, and wherein analyzing the corresponding elements comprisesusing a sampling population based on finite differences generated from ablock-based motion estimation between two or more of the video frames.7. The method of claim 1 comprising a method of factoring thecorrespondence models into local deformation models, the methodcomprising: defining a two dimensional mesh overlying pels correspondingto the at least one object, the mesh being based on a regular grid ofvertices and edges, and; generating a model of local motion from therelationships between the corresponding elements, the relationshipscomprising vertex displacements based on finite differences generatedfrom a block-based motion estimation between two or more of the videoframes.
 8. The method of claim 7 wherein the vertices correspond todiscrete image features, the method comprising identifying significantimage features corresponding to the object by using an analysis of theimage intensity gradient.
 9. The method of claim 3 comprising:forwarding the fourth intermediate form of the data for factoring into alocal deformation model; defining a two dimensional mesh overlying pelscorresponding to the at least one object, the mesh being based on aregular grid of vertices and edges, and; generating a model of localmotion from the relationships between the corresponding elements, therelationships comprising vertex displacements based on finitedifferences generated from a block-based motion estimation between twoor more of the video frames; and wherein local motion model is based onresidual motion not approximated by global motion model.
 10. The methodof claim 7 comprising: forwarding the fourth intermediate form of thedata for factoring into a local deformation model; defining a twodimensional mesh overlying pels corresponding to the at least oneobject, the mesh being based on a regular grid of vertices and edges,and; generating a model of local motion from the relationships betweenthe corresponding elements, the relationships comprising vertexdisplacements based on finite differences generated from a block-basedmotion estimation between two or more of the video frames; and whereinlocal motion model is based on residual motion not approximated byglobal motion model.